Whitehead method and Genetic Algorithms
نویسندگان
چکیده
In this paper we discuss a genetic version (GWA) of the Whitehead’s algorithm, which is one of the basic algorithms in combinatorial group theory. It turns out that GWA is surprisingly fast and outperforms the standard Whitehead’s algorithm in free groups of rank ≥ 5. Experimenting with GWA we collected an interesting numerical data that clarifies the time-complexity of the Whitehead’s Problem in general. These experiments led us to several mathematical conjectures. If confirmed they will shed light on hidden mechanisms of Whitehead Method and geometry of automorphic orbits in free groups.
منابع مشابه
Contemporary Mathematics Whitehead Method and Genetic Algorithms
In this paper we discuss a genetic version (GWA) of Whitehead Algorithm, which is one of the basic algorithms in combinatorial group theory. It turns out that GWA is surprisingly fast and outperforms the standard Whitehead algorithm in free groups of rank > 5. Experimenting with GWA we collected an interesting numerical data that clarifies the time-complexity of Whitehead’s Problem in general. ...
متن کاملA Comparison Between Fourier Transform Adomian Decomposition Method and Homotopy Perturbation ethod for Linear and Non-Linear Newell-Whitehead-Segel Equations
In this paper, a comparison among the hybrid of Fourier Transform and AdomianDecomposition Method (FTADM) and Homotopy Perturbation Method (HPM) is investigated.The linear and non-linear Newell-Whitehead-Segel (NWS) equations are solved and the results arecompared with the exact solution. The comparison reveals that for the same number of componentsof recursive sequences, the error of FTADM is ...
متن کاملA New Approach to Solve N-Queen Problem with Parallel Genetic Algorithm
Over the past few decades great efforts were made to solve uncertain hybrid optimization problems. The n-Queen problem is one of such problems that many solutions have been proposed for. The traditional methods to solve this problem are exponential in terms of runtime and are not acceptable in terms of space and memory complexity. In this study, parallel genetic algorithms are proposed to solve...
متن کاملSolving random inverse heat conduction problems using PSO and genetic algorithms
The main purpose of this paper is to solve an inverse random differential equation problem using evolutionary algorithms. Particle Swarm Algorithm and Genetic Algorithm are two algorithms that are used in this paper. In this paper, we solve the inverse problem by solving the inverse random differential equation using Crank-Nicholson's method. Then, using the particle swarm optimization algorith...
متن کاملA Novel Intrusion Detection Systems based on Genetic Algorithms-suggested Features by the Means of Different Permutations of Labels’ Orders
Intrusion detection systems (IDS) by exploiting Machine learning techniques are able to diagnose attack traffics behaviors. Because of relatively large numbers of features in IDS standard benchmark dataset, like KDD CUP 99 and NSL_KDD, features selection methods play an important role. Optimization algorithms like Genetic algorithms (GA) are capable of finding near-optimum combination of the fe...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره math.GR/0304283 شماره
صفحات -
تاریخ انتشار 2003